Improved Stable Retrieval in Noisy Collections
Identifieur interne : 000468 ( Main/Exploration ); précédent : 000467; suivant : 000469Improved Stable Retrieval in Noisy Collections
Auteurs : Gianni Amati [Italie] ; Alessandro Celi [Italie] ; Cesidio Di Nicola [Italie] ; Michele Flammini [Italie] ; Daniela Pavone [Italie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: We consider the problem of retrieval on noisy text collections. This is a paramount problem for retrieval with new social media collections, like Twitter, where typical messages are short, whilst dictionary is very large in size, plenty of variations of emoticons, term shortcuts and any other type of users jargon. In particular, we propose a new methodology which combines different effective techniques, some of them proposed in the OCR information retrieval literature, such as n-grams tokenization, approximate string matching algorithms, that need to be plugged in suitable IR models of retrieval and query reformulation. To evaluate the methodology we use the OCR degraded collections of the Confusion TREC. Unlike the solutions proposed by the TREC participants, tuned for specific collections and thus exhibiting a high variable performance among the different degradation levels, our model is highly stable. In fact, with the same tuned parameters, it reaches the best or nearly best performance simultaneously on all the three Confusion collections (Original, Degrade 5% and Degrade 20%), with a 33% improvement on the average MAP measure. Thus, it is a good candidate as a universal high precision strategy to be used when there isn’t any a priori knowledge of the specific domain. Moreover, our parameters can be specifically tuned in order to obtain the best up to date retrieval performance at all levels of collection degradation, and even on the clean collection, that is the original collection without the OCR errors.
Url:
DOI: 10.1007/978-3-642-23318-0_35
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000425
- to stream Istex, to step Curation: 000418
- to stream Istex, to step Checkpoint: 000125
- to stream Main, to step Merge: 000474
- to stream Main, to step Curation: 000468
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Improved Stable Retrieval in Noisy Collections</title>
<author><name sortKey="Amati, Gianni" sort="Amati, Gianni" uniqKey="Amati G" first="Gianni" last="Amati">Gianni Amati</name>
</author>
<author><name sortKey="Celi, Alessandro" sort="Celi, Alessandro" uniqKey="Celi A" first="Alessandro" last="Celi">Alessandro Celi</name>
</author>
<author><name sortKey="Di Nicola, Cesidio" sort="Di Nicola, Cesidio" uniqKey="Di Nicola C" first="Cesidio" last="Di Nicola">Cesidio Di Nicola</name>
</author>
<author><name sortKey="Flammini, Michele" sort="Flammini, Michele" uniqKey="Flammini M" first="Michele" last="Flammini">Michele Flammini</name>
</author>
<author><name sortKey="Pavone, Daniela" sort="Pavone, Daniela" uniqKey="Pavone D" first="Daniela" last="Pavone">Daniela Pavone</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:0BA843B833E348D2324D28493E7328D04DB118C6</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/978-3-642-23318-0_35</idno>
<idno type="url">https://api.istex.fr/document/0BA843B833E348D2324D28493E7328D04DB118C6/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000425</idno>
<idno type="wicri:Area/Istex/Curation">000418</idno>
<idno type="wicri:Area/Istex/Checkpoint">000125</idno>
<idno type="wicri:doubleKey">0302-9743:2011:Amati G:improved:stable:retrieval</idno>
<idno type="wicri:Area/Main/Merge">000474</idno>
<idno type="wicri:Area/Main/Curation">000468</idno>
<idno type="wicri:Area/Main/Exploration">000468</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Improved Stable Retrieval in Noisy Collections</title>
<author><name sortKey="Amati, Gianni" sort="Amati, Gianni" uniqKey="Amati G" first="Gianni" last="Amati">Gianni Amati</name>
<affiliation wicri:level="3"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Fondazione Ugo Bordoni, Rome</wicri:regionArea>
<placeName><settlement type="city">Rome</settlement>
<region nuts="2">Latium</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Department, of Computer Science, University of L’Aquila, L’Aquila</wicri:regionArea>
<wicri:noRegion>L’Aquila</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Celi, Alessandro" sort="Celi, Alessandro" uniqKey="Celi A" first="Alessandro" last="Celi">Alessandro Celi</name>
<affiliation wicri:level="3"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Fondazione Ugo Bordoni, Rome</wicri:regionArea>
<placeName><settlement type="city">Rome</settlement>
<region nuts="2">Latium</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Department, of Computer Science, University of L’Aquila, L’Aquila</wicri:regionArea>
<wicri:noRegion>L’Aquila</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Di Nicola, Cesidio" sort="Di Nicola, Cesidio" uniqKey="Di Nicola C" first="Cesidio" last="Di Nicola">Cesidio Di Nicola</name>
<affiliation wicri:level="3"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Fondazione Ugo Bordoni, Rome</wicri:regionArea>
<placeName><settlement type="city">Rome</settlement>
<region nuts="2">Latium</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Department, of Computer Science, University of L’Aquila, L’Aquila</wicri:regionArea>
<wicri:noRegion>L’Aquila</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Flammini, Michele" sort="Flammini, Michele" uniqKey="Flammini M" first="Michele" last="Flammini">Michele Flammini</name>
<affiliation wicri:level="3"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Fondazione Ugo Bordoni, Rome</wicri:regionArea>
<placeName><settlement type="city">Rome</settlement>
<region nuts="2">Latium</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Department, of Computer Science, University of L’Aquila, L’Aquila</wicri:regionArea>
<wicri:noRegion>L’Aquila</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Pavone, Daniela" sort="Pavone, Daniela" uniqKey="Pavone D" first="Daniela" last="Pavone">Daniela Pavone</name>
<affiliation wicri:level="3"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Fondazione Ugo Bordoni, Rome</wicri:regionArea>
<placeName><settlement type="city">Rome</settlement>
<region nuts="2">Latium</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country xml:lang="fr">Italie</country>
<wicri:regionArea>Department, of Computer Science, University of L’Aquila, L’Aquila</wicri:regionArea>
<wicri:noRegion>L’Aquila</wicri:noRegion>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2011</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">0BA843B833E348D2324D28493E7328D04DB118C6</idno>
<idno type="DOI">10.1007/978-3-642-23318-0_35</idno>
<idno type="ChapterID">35</idno>
<idno type="ChapterID">Chap35</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We consider the problem of retrieval on noisy text collections. This is a paramount problem for retrieval with new social media collections, like Twitter, where typical messages are short, whilst dictionary is very large in size, plenty of variations of emoticons, term shortcuts and any other type of users jargon. In particular, we propose a new methodology which combines different effective techniques, some of them proposed in the OCR information retrieval literature, such as n-grams tokenization, approximate string matching algorithms, that need to be plugged in suitable IR models of retrieval and query reformulation. To evaluate the methodology we use the OCR degraded collections of the Confusion TREC. Unlike the solutions proposed by the TREC participants, tuned for specific collections and thus exhibiting a high variable performance among the different degradation levels, our model is highly stable. In fact, with the same tuned parameters, it reaches the best or nearly best performance simultaneously on all the three Confusion collections (Original, Degrade 5% and Degrade 20%), with a 33% improvement on the average MAP measure. Thus, it is a good candidate as a universal high precision strategy to be used when there isn’t any a priori knowledge of the specific domain. Moreover, our parameters can be specifically tuned in order to obtain the best up to date retrieval performance at all levels of collection degradation, and even on the clean collection, that is the original collection without the OCR errors.</div>
</front>
</TEI>
<affiliations><list><country><li>Italie</li>
</country>
<region><li>Latium</li>
</region>
<settlement><li>Rome</li>
</settlement>
</list>
<tree><country name="Italie"><region name="Latium"><name sortKey="Amati, Gianni" sort="Amati, Gianni" uniqKey="Amati G" first="Gianni" last="Amati">Gianni Amati</name>
</region>
<name sortKey="Amati, Gianni" sort="Amati, Gianni" uniqKey="Amati G" first="Gianni" last="Amati">Gianni Amati</name>
<name sortKey="Celi, Alessandro" sort="Celi, Alessandro" uniqKey="Celi A" first="Alessandro" last="Celi">Alessandro Celi</name>
<name sortKey="Celi, Alessandro" sort="Celi, Alessandro" uniqKey="Celi A" first="Alessandro" last="Celi">Alessandro Celi</name>
<name sortKey="Di Nicola, Cesidio" sort="Di Nicola, Cesidio" uniqKey="Di Nicola C" first="Cesidio" last="Di Nicola">Cesidio Di Nicola</name>
<name sortKey="Di Nicola, Cesidio" sort="Di Nicola, Cesidio" uniqKey="Di Nicola C" first="Cesidio" last="Di Nicola">Cesidio Di Nicola</name>
<name sortKey="Flammini, Michele" sort="Flammini, Michele" uniqKey="Flammini M" first="Michele" last="Flammini">Michele Flammini</name>
<name sortKey="Flammini, Michele" sort="Flammini, Michele" uniqKey="Flammini M" first="Michele" last="Flammini">Michele Flammini</name>
<name sortKey="Pavone, Daniela" sort="Pavone, Daniela" uniqKey="Pavone D" first="Daniela" last="Pavone">Daniela Pavone</name>
<name sortKey="Pavone, Daniela" sort="Pavone, Daniela" uniqKey="Pavone D" first="Daniela" last="Pavone">Daniela Pavone</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000468 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000468 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= OcrV1 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:0BA843B833E348D2324D28493E7328D04DB118C6 |texte= Improved Stable Retrieval in Noisy Collections }}
This area was generated with Dilib version V0.6.32. |